Overcoming Byzantine Failures Using Checkpointing
نویسندگان
چکیده
The common approach to masking Byzantine failures is by replicating the computation and running a Byzantine agreement protocol among all replicas. However, Byzantine agreement incurs high communication overhead and also requires the use of at least 3f + 1 replicas in order to overcome f such failures. However, for many applications, and in particular scientific computation, it is possible to achieve the same goal with much lower average communication and replication overheads. This paper presents a new approach for detecting a Byzantine failure by combining checkpoint/restart with replication. The main benefit of the approach is that when there are no failures, we only use f +1 replicas. If a failure occurs, it is detected using a 3f +1node Byzantine agreement protocol, which also identifies the bad nodes and eliminates them, so the computation can proceed with f + 1 replicas until the next failure occurs.
منابع مشابه
ZZ: Cheap Practical BFT using Virtualization
Despite numerous efforts to improve their performance and scalability, Byzantine fault-tolerance (BFT) techniques remain expensive, and few commercial systems use BFT today. We present ZZ, a novel approach to construct general BFT services with a replication cost of practically f + 1, halving the 2f + 1 or higher cost incurred by state-of-the-art approaches. The key insight in ZZ is to use f + ...
متن کاملParsimony-Based Approach for Obtaining Resource-Efficient and Trustworthy Execution
We propose a resource-efficient way to execute requests in Byzantine-fault-tolerant replication that is particularly well-suited for services in which request processing is resource-intensive. Previous efforts took a failure-masking all-active approach of using all 2t+1 execution replicas to execute all requests, where t is the maximum number of failures tolerated. We describe an asynchronous e...
متن کاملA Secure Checkpointing Protocol for Survivable Server Design
Secure checkpointing appears to be a useful technique for designing survivable systems. These are fault-tolerant systems that are robust against malicious security attacks. Secure checkpointing, however, is not easily done. Without adequate protection, the checkpointing process can be attacked and compromised. The checkpointing data can be subjected to malicious attacks and be a source of secur...
متن کاملA Proposal to investigate the use of error correcting code techniques in implementing distributed systems resistant to Byzantine failures and security breaches
Throughout the literature on reliable distributed systems there is much coverage of systems which maintain correct operations in the face of fail-stop or non-Byzantine failures. What are less represented are methods for dealing with the harder problem of Byzantine failures. This paper proposes a method for dealing with these sort of failures. Fail-stop or non-Byzantine failures typically are ch...
متن کاملSharing Memory with Semi-Byzantine Clients and Faulty Storage Servers
This paper presents several fault-tolerant simulations of a single-writer multi-reader regular register in storage systems. One simulation tolerates fail-stop failures of storage servers and require a majority of nonfaulty servers, while the other simulation tolerates Byzantine failures and requires that two-thirds of the servers to be nonfaulty. A construction of Afek et al. [2] is used to mas...
متن کامل